Enforcing the Courant–Friedrichs–Lewy condition in explicitly conservative local time stepping schemes
نویسندگان
چکیده
منابع مشابه
Local Time-stepping for Explicit Discontinuous Galerkin Schemes
A class of explicit discontinuous Galerkin schemes is described which time approximation is based on a predictor corrector formulation. The approximation at the new time level is obtained in one step with use of the information from the direct neighbors only. This allows to introduce a local time-stepping for unsteady simulations with the property that every grid cell runs with its own optimal ...
متن کاملSecond - Order Conservative Schemes and the Entropy Condition
We consider numerical approximations to solutions of systems of hyperbolic conservation laws of the form du/dt + df(u)/dx = 0, u s R" and/: R" -> R" smooth. We show that conservative three-point second-order accurate methods cannot satisfy a local entropy inequality.
متن کاملNumerical Viscosity and the Entropy Condition for Conservative Difference Schemes
Consider a scalar, nonlinear conservative difference scheme satisfying the entropy condition. It is shown that difference schemes containing more numerical viscosity will necessarily converge to the unique, physically relevant weak solution of the approximated conservative equation. In particular, entropy satisfying convergence follows for E schemes—those containing more numerical viscosity tha...
متن کاملTowards optimal explicit time-stepping schemes for the gyrokinetic equations
The nonlinear gyrokinetic equations describe plasma turbulence in laboratory and astrophysical plasmas. To solve these equations, massively parallel codes are developed and run on present-day supercomputers. The goal of this paper is to improve the efficiency of such computations, thereby allowing for physically more comprehensive studies. Explicit Runge-Kutta schemes are considered to be well ...
متن کاملSilent error detection in numerical time-stepping schemes
Errors due to hardware or low level software problems, if detected, can be fixed by various schemes, such as recomputation from a checkpoint. Silent errors are errors in application state that have escaped low-level error detection. At extreme scale, where machines can perform astronomically many operations per second, silent errors threaten the validity of computed results. We propose a new pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2018
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2018.01.008